منابع مشابه
A lower bound for the determinantal complexity of a hypersurface
We prove that the determinantal complexity of a hypersurface of degree d > 2 is bounded below by one more than the codimension of the singular locus, provided that this codimension is at least 5. As a result, we obtain that the determinantal complexity of the 3×3 permanent is 7. We also prove that for n > 3, there is no nonsingular hypersurface in Pn of degree d that has an expression as a dete...
متن کاملA lower bound for ...
Let A and B be two finite subsets of a field F. In this paper we provide a nontrivial lower bound for |{a + b: a ∈ A, b ∈ B, and P (a, b) 6= 0}| where P (x, y) ∈ F[x, y].
متن کاملA Lower Bound for
It is proved that there is a monotone function in AC(0) 4 which requires exponential size monotone perceptrons of depth 3. This solves the monotone version of a problem which, in the general case, would imply an oracle separation of PPPH.
متن کاملA Matrix Lower Bound
A matrix lower bound is defined that generalizes ideas apparently due to S. Banach and J. von Neumann. The matrix lower bound has a natural interpretation in functional analysis, and it satisfies many of the properties that von Neumann stated for it in a restricted case. Applications for the matrix lower bound are demonstrated in several areas. In linear algebra, the matrix lower bound of a ful...
متن کاملA Lower Bound Theorem
Motivated by Candes and Donoho′s work (Candés, E J, Donoho, D L, Recovering edges in ill-posed inverse problems: optimality of curvelet frames. Ann. Stat. 30, 784-842 (2002)), this paper is devoted to giving a lower bound of minimax mean square errors for Riesz fractional integration transforms and Bessel transforms.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2001
ISSN: 0024-3795
DOI: 10.1016/s0024-3795(00)00287-1